Extending Prolog with Nonmonotonic Reasoning
نویسنده
چکیده
Nonmonotonic reasoning has been developed to capture common sense inferences. This paper considers nonmonotonic reasoning in logic programs with negation { its implementation using Prolog and its integration with Prolog execution. Even within logic programming frameworks, a variety of inferencing methods, model-theoretic semantics, and language features have been proposed for diierent forms of nonmonotonic reasoning. A challenging problem is to incorporate them into an integrated system. This paper describes an implementation of such a system, including the interoperation between Prolog execution and tabled evaluation, and diierent reasoning capabilities that are supported. By combining Prolog technology with various mechanisms of nonmonotonic reasoning, the resulting system ooers a more realistic testbed for applications of common sense reasoning.
منابع مشابه
KLMLean 2.0: A Theorem Prover for KLM Logics of Nonmonotonic Reasoning
We present KLMLean 2.0, a theorem prover for propositional KLM logics of nonmonotonic reasoning. KLMLean 2.0 implements some analytic tableaux calculi for these logics recently introduced. KLMLean 2.0 is inspired by the “lean” methodology, it is implemented in SICStus Prolog and it also contains a graphical interface written in Java.
متن کاملKLM Logics of Nonmonotonic Reasoning: Calculi and Implementations
We present proof methods for the logics of nonmonotonic reasoning defined by Kraus, Lehmann and Magidor (KLM). We introduce tableaux calculi (called T S) for all KLM logics. We provide decision procedures for KLM logics based on these calculi, and we study their complexity. Finally, we describe KLMLean 2.0, a theorem prover implementing the calculi T S inspired by the “lean” methodology. KLMLea...
متن کاملAn Implementation of a Free-Variable Tableaux for KLM Preferential Logic P of Nonmonotonic Reasoning: The Theorem Prover FreeP 1.0
In this work we present FREEP 1.0, a theorem prover for the KLM preferential logic P of nonmonotonic reasoning. FREEP 1.0 is a SICStus Prolog implementation of a free-variables, labelled tableau calculus for P, obtained by introducing suitable modalities to interpret conditional assertions. The performances of FREEP 1.0 are promising. FREEP 1.0 can be downloaded at http:// www.di.unito.it/∼pozz...
متن کاملExtending Defeasible Logic and Defeasible Prolog
Defeasible logic (DL) promotes enthymemic, argumentative reasoning on incomplete set of premisses retracted on the presence of contrary information. Defeasible Prolog (d-Prolog) is a Prolog metainterpreter to implement DL. We give proof conditions for the even-if clauses of DL with the pre-emption of defeaters to prevent rules from rebutting more specific rules, implemented in d-Prolog.
متن کاملExecutable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules
Constraint Handling Rules (CHR) is an extension to Prolog which opens up a spectrum of hypothesis-based reasoning in logic programs without additional interpretation overhead. Abduction with integrity constraints is one example of hypothesisbased reasoning which can be implemented directly in Prolog and CHR with a straightforward use of available and efficiently implemented facilities. The pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Program.
دوره 27 شماره
صفحات -
تاریخ انتشار 1996